ar X iv : c s . L O / 0 30 61 21 v 1 2 2 Ju n 20 03 REACHABILITY PROBLEMS FOR COMMUNICATING FINITE STATE MACHINES * Jan

ar X iv : c s / 03 10 04 6 v 2 [ cs . C C ] 1 4 Ju n 20 04 Theory of One Tape Linear Time Turing Machines ∗

A theory of one-tape linear-time Turing machines is quite different from its polynomial-time counterpart since one-tape linear-time Turing machines are closely related to finite state automata. This paper discusses structural-complexity issues of one-tape Turing machines of various types (deterministic, nondeterministic, reversible, alternating, probabilistic, counting, and quantum Turing machi...

ar X iv : n uc l - ex / 0 30 50 34 v 2 1 4 Ju n 20 03 ρ ( 770 ) 0 and f 0 ( 980 ) Production in Au + Au and pp

ar X iv : 0 70 7 . 33 03 v 1 [ m at h . O A ] 2 3 Ju l 2 00 7 OPERATOR - VALUED FRAMES

ar X iv : n uc l - th / 0 30 70 01 v 1 3 0 Ju n 20 03 - 1 - CORRELATION BETWEEN THE DEUTERON CHARACTERISTICS AND THE LOW - ENERGY TRIPLET np SCATTERING PARAMETERS

Reachability problems for communicating finite state machines

1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability analysis and abstract flow control 6. Affine SR-machines 7. Undecidable problems 8. Rational channels for cyclic protocols 9. Recognizable channels for general protocols 10. Abstract flow control in general graphs 11. Recapitulation and conclusions Appendix: Post's tag syst...